A QoS-Aware Multicast Routing Protocol - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
نویسندگان
چکیده
The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network with excessive overhead. We propose QMRP, a new Qos-aware Multicast Routing Protocol. QMRP achieves scalability by signiflcantly reducing the communication overhead of constructing a multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path routing and multiple-path muting according to the current network conditions. The high level design of QMRP makes it operable on top of any unicast routing algorithm in both intra-domain and inter-domain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of routing without the use of timeout. In addition, QMRP always constructs loopfree multicast trees.
منابع مشابه
Multicast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کاملNear-Optimal Routing Lookups with Bounded Worst Case Performance - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have been proposed. In this paper we consider one such data structure a binary search tree built on the intervals created by the routing table prefixes. We wish to exploit the difference in the probabilities with which the various leav...
متن کاملAn Enhanced Random Early Marking Algorithm for Internet Flow Control - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
AbstructWe propose earlier an optimization based flow control for the Internet called Random Early Mark@ (REM). In this paper we propose and evaluate an enhancement that attempts to sped up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algori...
متن کاملMultiple Time Scale Redundancy Control for QoS-Sensitive Transport of Real-time Traffic - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
Absrracr-End-taend QOS control over best-effort and differentiated service networks which exhibit variability in their exported service properties looms as an important challenge. In previous work, we have shown how packet-level adaptive FEC can be used in dynamic networks to fadlitate invariant user-specified QoS in an end-to-end manner. This paper addresses two important problems-seit-similar...
متن کاملResource Allocation in a Multicast Tree - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth resewed at the link by all receivers using that link We formulate and solve a problem of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004